Graph analysis of network flow connectivity behaviors
نویسندگان
چکیده
منابع مشابه
analysis of power in the network society
اندیشمندان و صاحب نظران علوم اجتماعی بر این باورند که مرحله تازه ای در تاریخ جوامع بشری اغاز شده است. ویژگیهای این جامعه نو را می توان پدیده هایی از جمله اقتصاد اطلاعاتی جهانی ، هندسه متغیر شبکه ای، فرهنگ مجاز واقعی ، توسعه حیرت انگیز فناوری های دیجیتال، خدمات پیوسته و نیز فشردگی زمان و مکان برشمرد. از سوی دیگر قدرت به عنوان موضوع اصلی علم سیاست جایگاه مهمی در روابط انسانی دارد، قدرت و بازتولید...
15 صفحه اولGraph analysis of spontaneous brain network using EEG source connectivity
Exploring the human brain networks during rest is a topic of great interest. Several structural and functional studies have previously been conducted to study the intrinsic brain networks. In this paper, we focus on investigating the human brain network topology using dense Electroencephalography (EEG) source connectivity approach. We applied graph theoretical methods on functional networks rec...
متن کاملGraph Connectivity and Network Coding
Graph Connectivity and Network Coding LEUNG, Kai Man Master of Philosophy Department of Computer Science and Engineering The Chinese University of Hong Kong 2011 In this thesis we present a new algebraic formulation to compute edge connectivities in a directed graph, using the ideas developed in network coding. This reduces the problem of computing edge connectivities to solving systems of line...
متن کاملIdentification of mild cognitive impairment disease using brain functional connectivity and graph analysis in fMRI data
Background: Early diagnosis of patients in the early stages of Alzheimer's, known as mild cognitive impairment, is of great importance in the treatment of this disease. If a patient can be diagnosed at this stage, it is possible to treat or delay Alzheimer's disease. Resting-state functional magnetic resonance imaging (fMRI) is very common in the process of diagnosing Alzheimer's disease. In th...
متن کاملGraph Algorithms for Network Connectivity Problems
This paper surveys the recent progress on the graph algorithms for solving network connectivity problems such as the extreme set problem, the cactus representation problem, the edge-connectivity augmentation problem and the source location problem. In particular, we show that efficient algorithms for these problems can be designed based on maximum adjacency orderings.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES
سال: 2019
ISSN: 1303-6203
DOI: 10.3906/elk-1808-148